On Antimagic Labeling for Some Families of Graphs

Antimagic labeling of a graph with vertices and edges is assigned the labels for its by some integers from set , such that no two received same label, weights are pairwise distinct. Where vertex-weights vertex under this sum all incident to vertex, in paper, we deal problem finding antimagic edge special families graphs called strong face graphs. We prove antimagic, ladder wheel fan prism finally friendship .